package no17;

/**
 * @author 兴趣使然黄小黄
 * @version 1.0
 * @date 2023/4/23 22:30
 * 打印从1到最大的n位数
 * https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/
 */
public class Solution {

    public int[] printNumbers(int n) {
        int max = (int) Math.pow(10, n);
        int[] res = new int[max-1];
        for(int i = 0; i < res.length; i++) {
            res[i] = i + 1;
        }
        return res;
    }
}
